<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>Swarm Trajectory Planning: src/vtk_voro/dijkstra_heap.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Swarm Trajectory Planning
   </div>
   <div id="projectbrief">Contains tools for measuring UAV swarm performance when flying through a path graph and allows the UAV swarm to fly through a generated graph.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_9671a9f33d055109bbd7c6917741663d.html">vtk_voro</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">dijkstra_heap.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * File name: dijkstra_heap.h</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> * Date:      2008/07/30 11:52</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * Author:    Jan Faigl</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="preprocessor">#ifndef __DIJKSTRA_HEAP_H__</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#define __DIJKSTRA_HEAP_H__</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceimr.html">imr</a> {</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;   <span class="keyword">namespace </span><a class="code" href="graph_8cpp.html#a7f0876063956a2c9f083434f30d8abd3">dijkstra</a> {</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#define HEAPNODE(i) heap[i].node</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#define HEAPIDX(i) heap[i].IDX</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;      <span class="keyword">template</span>&lt;<span class="keyword">class</span> Nodes, <span class="keyword">class</span> Weight&gt;</div><div class="line"><a name="l00017"></a><span class="lineno"><a class="line" href="classimr_1_1dijkstra_1_1CHeap.html">   17</a></span>&#160;         <span class="keyword">class </span><a class="code" href="classimr_1_1dijkstra_1_1CHeap.html">CHeap</a> {</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;            <span class="keyword">struct </span>SHeap {</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> IDX;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> node;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;               Weight cost;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;            };</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;            <span class="keyword">inline</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> get_parent(<span class="keywordtype">long</span> <span class="keywordtype">int</span> i) {</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;               <span class="keywordflow">return</span> (i-1) &gt;&gt; 1;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;            }</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;            <span class="keyword">inline</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> get_left(<span class="keywordtype">long</span> <span class="keywordtype">int</span> i) {</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;               <span class="keywordflow">return</span> (i&lt;&lt;1) + 1;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;            }</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#define HEAPCOST(i) heap[i].cost</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;            <span class="comment">//#define HEAPCOST(i) nodes[HEAPNODE(i)].cost</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;            <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(<span class="keywordtype">long</span> <span class="keywordtype">int</span> i, <span class="keywordtype">long</span> <span class="keywordtype">int</span> j) {</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;               <span class="comment">//#define HEAP_SWAP(i,j) HEAPIDX(HEAPNODE(i)) = j; HEAPIDX(HEAPNODE(j)) = i; t = HEAPNODE(i); HEAPNODE(i) = HEAPNODE(j); HEAPNODE(j) = t; t = HEAPCOST(i); HEAPCOST(i) = HEAPCOST(j); HEAPCOST(j) = t;</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;               <span class="comment">//#define HEAP_SWAP(i,j) HEAPIDX(HEAPNODE(i)) = j; HEAPIDX(HEAPNODE(j)) = i; t = HEAPNODE(i); HEAPNODE(i) = HEAPNODE(j); HEAPNODE(j) = t;</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> t;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;               HEAPIDX(HEAPNODE(i)) = j; </div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;               HEAPIDX(HEAPNODE(j)) = i; </div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;               t = HEAPNODE(i); </div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;               HEAPNODE(i) = HEAPNODE(j); </div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;               HEAPNODE(j) = t;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;               Weight w = HEAPCOST(i); </div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;               HEAPCOST(i) = HEAPCOST(j);</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;               HEAPCOST(j) = w;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            }</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            <span class="keyword">public</span>:</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            <a class="code" href="classimr_1_1dijkstra_1_1CHeap.html">CHeap</a>(<span class="keywordtype">long</span> <span class="keywordtype">int</span> size, Nodes &amp; nodes) : size(size), nodes(nodes) {</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;               heap = 0;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;               heapNumber = 0;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;               heap = <span class="keyword">new</span> SHeap[size];</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;               <span class="keywordflow">for</span> (<span class="keywordtype">long</span> <span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;                  HEAPIDX(i) = -1; </div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;               } </div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            }</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;            ~<a class="code" href="classimr_1_1dijkstra_1_1CHeap.html">CHeap</a>(<span class="keywordtype">void</span>) {</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;               <span class="keyword">delete</span>[] heap;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            }</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keyword">inline</span> <span class="keywordtype">void</span> add(<span class="keywordtype">long</span> <span class="keywordtype">int</span> n, Weight cost) {</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> parent;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> index;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;               HEAPNODE(heapNumber) = n;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;               HEAPCOST(heapNumber) = cost;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;               HEAPIDX(n) = heapNumber;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;               index = heapNumber; </div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;               parent = get_parent(index);</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;               <span class="keywordflow">while</span> (index &gt;= 1 &amp;&amp; (HEAPCOST(parent) &gt; HEAPCOST(index))) {</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                  swap(parent, index);</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                  index  = parent;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                  parent = get_parent(index);</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;               }</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;               heapNumber++;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            }</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            <span class="keyword">inline</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> getFirst(<span class="keywordtype">void</span>) {</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> ret;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;               <span class="keywordflow">if</span> (heapNumber == 0) {</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;                  ret = -1;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;               } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;                  ret = HEAPNODE(0);</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;                  heapNumber--;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;                  HEAPNODE(0) = HEAPNODE(heapNumber);</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                  HEAPCOST(0) = HEAPCOST(heapNumber);</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;                  HEAPIDX(HEAPNODE(0)) = 0;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                  down();</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;               }</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;               <span class="keywordflow">return</span> ret;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            }</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keyword">inline</span> <span class="keywordtype">void</span> down(<span class="keywordtype">void</span>) {</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> index;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> hl, hr;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> best ;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;               index = 0;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;               hl = get_left(index);</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;               <span class="keywordflow">if</span> (hl &gt;= heapNumber) {</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;               } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;                  <span class="keywordflow">while</span>(hl &lt; heapNumber) {</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;                     hr = hl+1;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;                     <span class="keywordflow">if</span> (HEAPCOST(index) &gt; HEAPCOST(hl)) {</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;                        best = hl;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;                     } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                        best = index;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                     }</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                     <span class="keywordflow">if</span> (hr &lt; heapNumber &amp;&amp; HEAPCOST(best) &gt; HEAPCOST(hr)) {</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;                        best = hr;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                     }</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;                     <span class="keywordflow">if</span> (best != index) { <span class="comment">// lower value found</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;                        swap(index, best);</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                        index = best;</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                        hl = get_left(index);</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                     } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;                        <span class="keywordflow">break</span>;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                     }</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                  }</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;               }</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;               <span class="comment">//check_heap(0, heap, nodes);</span></div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            }</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;            <span class="keywordtype">void</span> <span class="keyword">inline</span> update(<span class="keywordtype">long</span> <span class="keywordtype">int</span> n, Weight cost) {</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> index;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> parent;</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;               index = HEAPIDX(n);</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;               HEAPCOST(index) = cost;</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;               <span class="keywordflow">if</span> (index &lt; heapNumber) {</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                  parent = get_parent(index);</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                  <span class="keywordflow">while</span> (index &gt;= 1 &amp;&amp; HEAPCOST(index) &lt; HEAPCOST(parent)) {  <span class="comment">//swap with parent</span></div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                     swap(index, parent);</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                     index = parent;</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                     parent = get_parent(index);</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                  }</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;               } </div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;               <span class="comment">// check_heap(0, heap, nodes);</span></div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            } </div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;            <span class="keywordtype">void</span> <span class="keyword">inline</span> is_valid(<span class="keywordtype">long</span> <span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> l = 2*n+1;</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;               <span class="keywordtype">long</span> <span class="keywordtype">int</span> r = 2*n+2;</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;               <span class="keywordflow">if</span> (l &lt; heapNumber) {</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                  <span class="keywordflow">if</span> (HEAPCOST(l) &lt; HEAPCOST(n)) {</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                     <span class="comment">//TODO assert</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;                     <span class="comment">/*  fprlong intf(stderr, &quot;HEAP PROPERTY VIOLENCE l:%d n:%d cost %d %d\n&quot;, l, n,</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;<span class="comment">                         HEAPCOST(l), HEAPCOST(n));</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;<span class="comment">                         */</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;                     is_valid(l);</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                  }</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;               }</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;               <span class="keywordflow">if</span> (r &lt; heapNumber) {</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                  <span class="keywordflow">if</span> (HEAPCOST(r) &lt; HEAPCOST(n)) {</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                     <span class="comment">//TODO assert</span></div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                     <span class="comment">// fprlong intf(stderr, &quot;HEAP PROPERTY VIOLENCE r:%d n:%d\n&quot;, r, n);</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                  }</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                  is_valid(r);</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;               }</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;            }</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;            <span class="keywordtype">long</span> <span class="keywordtype">int</span> &amp; getIDX(<span class="keywordtype">long</span> <span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;               <span class="keywordflow">return</span> HEAPIDX(n);</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            }</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;            <span class="keyword">private</span>:</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            <span class="keywordtype">long</span> <span class="keywordtype">int</span> size;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            SHeap * heap;</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            <span class="keywordtype">long</span> <span class="keywordtype">int</span> heapNumber;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            Nodes &amp; nodes;</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;         };</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;   } <span class="comment">//end namespace dijkstra</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;} <span class="comment">//end namespace imr</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;<span class="comment">/* end of heap.h */</span></div><div class="ttc" id="namespaceimr_html"><div class="ttname"><a href="namespaceimr.html">imr</a></div><div class="ttdef"><b>Definition:</b> dijkstra_heap.h:10</div></div>
<div class="ttc" id="graph_8cpp_html_a7f0876063956a2c9f083434f30d8abd3"><div class="ttname"><a href="graph_8cpp.html#a7f0876063956a2c9f083434f30d8abd3">dijkstra</a></div><div class="ttdeci">vector&lt; int &gt; dijkstra(vector&lt; vector&lt; double &gt;&gt; graph, int src, int goal, unsigned long vnum)</div><div class="ttdef"><b>Definition:</b> graph.cpp:94</div></div>
<div class="ttc" id="classimr_1_1dijkstra_1_1CHeap_html"><div class="ttname"><a href="classimr_1_1dijkstra_1_1CHeap.html">imr::dijkstra::CHeap</a></div><div class="ttdef"><b>Definition:</b> dijkstra_heap.h:17</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.11
</small></address>
</body>
</html>
